Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler
نویسنده
چکیده
This paper presents distributed self-stabilizing algorithms for the maximal independent and the minimal dominating set problems. Using an unfair distributed scheduler the algorithms stabilizes in at most max{3n− 5,2n} resp. 9n moves. All previously known algorithms required O(n2) moves. © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Fast self-stabilizing k-independent dominating set construction
We propose a fast silent self-stabilizing building a k-independent dominating set, named FID. The convergence of protocol FID, is established for any computation under the unfair distributed scheduler. FID reaches a terminal (also legitimate) configuration in at most 4n+k rounds, where n is the network size. FID requires (k + 1)log(n+ 1) bits per node. keywords distributed computing, fault tole...
متن کاملFast self - stabilizing k - independent dominating set construction ? Labri Technical Report
We propose a fast silent self-stabilizing building a k-independent dominating set, named FID. The convergence of protocol FID, is established for any computation under the unfair distributed scheduler. FID reaches a terminal (also legitimate) configuration in at most 4n+k rounds, where n is the network size. FID requires (k + 1)log(n+ 1) bits per node. keywords distributed computing, fault tole...
متن کاملFast, silent self-stabilizing distance-k independent dominating set construction
We propose a fast, silent self-stabilizing protocol building a distance-k independent dominating set, named FID. The convergence of the protocol FID is established for any computation under the unfair distributed scheduler. The protocol FID reaches a terminal (also legitimate) configuration in at most 4n+k rounds, where n is the network size; it requires (k + 1)log(n + 1) bits per node. keyword...
متن کاملMemory Efficient Self-stabilizing Distance-k Independent Dominating Set Construction
We propose a memory efficient self-stabilizing protocol building distance-k independent dominating sets. A distance-k independent dominating set is a distance-k independent set and a distance-k dominating set. Our algorithm, named SID, is silent; it converges under the unfair distributed scheduler (the weakest scheduling assumption). The protocol SID is memory efficient : it requires only log(2...
متن کاملMemory efficient Self - Stabilizing k - Independent Dominating
We propose a memory efficient self-stabilizing protocol building k-independent dominating sets. A k-independent dominating set is a k-independent set and a kdominating set. A set of nodes, I, is k-independent if the distance between any pair of nodes in I is at least k + 1. A set of nodes, D, is a k-dominating if every node is within distance k of a node of D. Our algorithm, named SID, is silen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 103 شماره
صفحات -
تاریخ انتشار 2007